package e;

public class Gedebahe {

	public boolean judgePrime(int i) {
		for (int n = 2; n < i / 2 + 1; n++) {
			if (i % n == 0) {
				return false;
			}
		}
		return true;
	}

	public void fenJie(int a) {
		for (int i = 2; i < a / 2; i++) {
			if (judgePrime(i) && judgePrime(a - i)) {
				System.out.println(a + "=" + i + "+" + (a - i));
			}
		}
	}

}